Notes on factoring

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Factoring

This is a survey article on factoring. Given the importance of factoring, or rather the difficulty thereof, in the security of RSA and other cryptosystems, it is worth having an overview of the area. Mathematics Subject Classification: Primary: 11A41; Secondary: 11A51

متن کامل

Based on RSA and Factoring

Abstract—Non-malleability is an important property in commitment schemes. It can resist to the person-in-the-middle (PIM) attacks within the interaction. In this paper, we focus on the non-malleability in ID-based trapdoor commitments. We first give two constructions of (full) ID-based trapdoor commitment schemes based on RSA and Factoring assumptions respectively and then extend them to non-m...

متن کامل

Threshold Cryptosystems Based on Factoring

We consider threshold cryptosystems over a composite modulus N where the factors of N are shared among the participants as the secret key. This is a new paradigm for threshold cryptosystems based on a composite modulus, differing from the typical treatment of RSA-based systems where a “decryption exponent” is shared among the participants. Our approach yields solutions to some open problems in ...

متن کامل

Notes on Lactuca saligna in Iran

In the identification process of weed materials available in "IRAN" herbarium, a specimen belonging to the genus Lactuca (Asteraceae) had the following characteristics: Plant annual, many stemmed from base; stem erect-slightly procumbent, slender, glabrous, whitish and leafy. Basal leaves dried; stem leaves ca. 7 × 0.5 cm, glabrous, linear-lanceolate, entire at margin, sessile, auriculate, auri...

متن کامل

On the Correctness of the Factoring Transformation

Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. Recently we analyzed a program transformation, called factoring transformation [4], that may save both execution time and memory occupation in a non-deterministic computation. In this paper we study the formal properties of our transformation, proving its co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1893

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500001620